Characterizing Unambiguous Augmented Pushdown Automata by Circuits 3
نویسنده
چکیده
The notions of weak and strong unambiguity of augmented push-down automata are considered and related to unambiguities of circuits. In particular we exhibit circuit classes exactly characterizing polynomially time bounded unambiguous augmented push-down automata.
منابع مشابه
Unambiguous Simulations of Auxiliary Pushdown Automata and Circuits 3 (preliminary Version)
In this paper time-bounded auxiliary push-down automata (AuxPDA), i.e. time and space bounded Turing machines with additional pushdown store, are considered. We investigate the power of unambiguous AuxPDA, i.e., machines that have at most one accepting computation, and ambiguity bounded AuxPDA. Recently, it was shown by Buntrock, Hemachandra, and Siefkes that space bounded Turing machines, whos...
متن کاملBinary Reachability Analysis of Discrete Pushdown Timed Automata
We introduce discrete pushdown timed automata that are timed automata with integer-valued clocks augmented with a pushdown stack. A con guration of a discrete pushdown timed automaton includes a control state, nitely many clock values and a stack word. Using a pure automata-theoretic approach, we show that the binary reachability (i.e., the set of all pairs of con gurations ( ; ), encoded as st...
متن کاملA Note on the Succinctness of Descriptions of Deterministic Languages
The result proved in this paper is that for the elements of some infinite class of deterministic context-free languages the size of deterministic pushdown amomata needed to describe them is not recursively bounded by the size of the smallest unambiguous context-free grammars that generate them. This is a quantitative explanation of the fact that some languages require large descriptions in term...
متن کاملBinary Reachability Analysis of
We introduce discrete pushdown timed automata that are timed automata with integer-valued clocks augmented with a pushdown stack. A connguration of a discrete pushdown timed automaton includes a control state, nitely many clock values and a stack word. Using a pure automata-theoretic approach, we show that the binary reachability (i.e., the set of all pairs of conngurations (;), encoded as stri...
متن کاملPast Pushdown Timed Automata
We consider past pushdown timed automata that are discrete pushdown timed automata [15] with past-formulas as enabling conditions. Using past formulas allows a past pushdown timed automaton to access the past values of the finite state variables in the automaton. We prove that the reachability (i.e., the set of reachable configurations from an initial configuration) of a past pushdown timed aut...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1990